全文获取类型
收费全文 | 2017篇 |
免费 | 217篇 |
国内免费 | 160篇 |
专业分类
化学 | 96篇 |
力学 | 206篇 |
综合类 | 60篇 |
数学 | 1693篇 |
物理学 | 339篇 |
出版年
2024年 | 2篇 |
2023年 | 17篇 |
2022年 | 24篇 |
2021年 | 33篇 |
2020年 | 51篇 |
2019年 | 45篇 |
2018年 | 43篇 |
2017年 | 38篇 |
2016年 | 66篇 |
2015年 | 49篇 |
2014年 | 93篇 |
2013年 | 136篇 |
2012年 | 100篇 |
2011年 | 112篇 |
2010年 | 111篇 |
2009年 | 123篇 |
2008年 | 126篇 |
2007年 | 131篇 |
2006年 | 135篇 |
2005年 | 122篇 |
2004年 | 109篇 |
2003年 | 92篇 |
2002年 | 113篇 |
2001年 | 78篇 |
2000年 | 87篇 |
1999年 | 58篇 |
1998年 | 45篇 |
1997年 | 37篇 |
1996年 | 44篇 |
1995年 | 41篇 |
1994年 | 29篇 |
1993年 | 11篇 |
1992年 | 15篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1972年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有2394条查询结果,搜索用时 15 毫秒
1.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
2.
3.
曾六川 《数学物理学报(A辑)》2002,22(1):99-106
该文研究Banach空间中一类强增生型变分包含解的存在性及其具误差的Ishikawa迭代程序的收敛性问题.该文结果是几位作者早期与最近的相应结果的改进和推广. 相似文献
4.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献
5.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
6.
Let Ψ(x,y) (resp. Ψm(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψm(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37 相似文献
7.
曾六川 《高等学校计算数学学报(英文版)》2003,12(1)
The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors. 相似文献
8.
On General Mixed Quasivariational Inequalities 总被引:5,自引:0,他引:5
In this paper, we suggest and analyze several iterative methods for solving general mixed quasivariational inequalities by using the technique of updating the solution and the auxiliary principle. It is shown that the convergence of these methods requires either the pseudomonotonicity or the partially relaxed strong monotonicity of the operator. Proofs of convergence is very simple. Our new methods differ from the existing methods for solving various classes of variational inequalities and related optimization problems. Various special cases are also discussed. 相似文献
9.
In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the Lp norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞. 相似文献
10.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献